//http://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701

#include<helper.h>

vector<int> PrintFromTopToBottom(TreeNode *root) {
    queue<TreeNode*> q;
    vector<int> res;
     if (root!=NULL) q.push(root);
    for (;!q.empty();){
        TreeNode* me=q.front();q.pop();
        res.push_back(me->val);
        if (me->left!=NULL) q.push(me->left);
        if (me->right!=NULL) q.push(me->right);
    }
    return res;

    }

int main(){
    return 0;
}